Snake-Deterministic Tiling Systems
نویسندگان
چکیده
The concept of determinism, while clear and well assessed for string languages, is still matter of research as far as picture languages are concerned. We introduce here a new kind of determinism, called snake, based on the boustrophedonic scanning strategy, that is a natural scanning strategy used by many algorithms on 2D arrays and pictures. We consider a snake-deterministic variant of tiling systems, which defines the so-called Snake-DREC class of languages. Snake-DREC properly extends the more traditional approach of diagonal-based determinism, used e.g. by deterministic tiling systems, and by online tessellation automata. Our main result is showing that the concept of snake-determinism of tiles coincides with row (or column) unambiguity.
منابع مشابه
Deterministic recognizability of picture languages by Wang automata
Picture languages are a generalization of string languages to two dimensions: a picture is a twodimensional array of elements from a finite alphabet. Several classes of picture languages have been considered in the literature [5,7,3,10]. In particular, here we refer to class REC introduced in [5] with the aim to generalize to 2D the class of regular string languages. REC is a robust class that ...
متن کاملHereditary History Preserving Simulation is Undecidable
We show undecidability of hereditary history preserving simulation for finite asynchronous transition systems by a reduction from the halting problem of deterministic Turing machines. To make the proof more transparent we introduce an intermediate problem of deciding the winner in domino snake games. First we reduce the halting problem of deterministic Turing machines to domino snake games. The...
متن کاملPicture Recognizability with Automata Based on Wang Tiles
We introduce a model of automaton for picture language recognition which is based on tiles and is called Wang automaton, since its description relies on the notation of Wang systems. Wang automata combine features of both online tessellation acceptors and 4-ways automata: as in online tessellation acceptors, computation assigns states to each picture position; as in 4-way automata, the input he...
متن کاملFrom Determinism to Non-determinism in Recognizable Two-Dimensional Languages
Tiling systems that recognize two-dimensional languages are intrinsically non-deterministic models. We introduce the notion of deterministic tiling system that generalizes deterministic automata for strings. The corresponding family of languages matches all the requirements of a robust deterministic class. Furthermore we show that, differently from the one-dimensional case, there exist many cla...
متن کاملPerfectly quilted rectangular snake tilings
2 contents º two families PQRS ⇒ Wang undecidability Wang ⇒ PQRS (± scaling) iterated substitutions 3 squares with middle finite & rectangular 4 Wang tiles for squares with middle 1 0 0 1 0 1 1 0 2 1 1 0 2 2 0 0 0 0 2 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 2 0 1 0 1 0 2 2 1 0 1 5 Wang tiles 0 0 0 0 0 0 0 0 1 0 1 1 0 0 0 0 0 0 0 0 1 0 0 1 0 1 1 0 0 0 0 0 0 0 1 0 0 1 2 1 1 0 0 0 2 2 0 0 0 ...
متن کامل